-
1 наибольшее собственное значение
largest eigenvalue мат.Русско-английский научно-технический словарь Масловского > наибольшее собственное значение
-
2 наибольшее собственное значение
Mathematics: largest eigenvalueУниверсальный русско-английский словарь > наибольшее собственное значение
-
3 Определенные артикли перед существительными, которые снабжены ссылками
The differential problem (1) can be reduced to the form (2)The asymptotic formula (1) follows from the above lemmaThe differential equation (1) can be solved numericallyWhat is needed in the final result is a simple bound on quantities of the form (1)The inequality (1) (артикль можно опустить) shows that $a>b$The bound (estimate) (2) is not quite as good as the bound (estimate) (1)If the norm of $A$ satisfies the restriction (1), then by the estimate (2) this term is less than unitySince the spectral radius of $A$ belongs to the region (1), this iterative method converges for any initial guessesThe array (1) is called the matrix representing the linear transformation of $f$It should be noted that the approximate inequality (1) bounds only the absolute error in $x$The inequality (1) shows that...The second step in our analysis is to substitute the forms (1) and (2) into this equation and simplify it by dropping higher-order termsFor small $ze$ the approximation (1) is very good indeedA matrix of the form (1), in which some eigenvalue appears in more than one block, is called a derogatory matrixThe relation between limits and norms is suggested by the equivalence (1)For this reason the matrix norm (1) is seldom encountered in the literatureTo establish the inequality (1) from the definition (2)Our conclusion agrees with the estimate (1)The characterization is established in almost the same way as the results of Theorem 1, except that the relations (1) and (2) take place in the eigenvalue-eigenvector relation...This vector satisfies the differential equation (1)The Euclidean vector norm (2) satisfies the properties (1)The bound (1) ensures only that these elements are small compared with the largest element of $A$There is some terminology associated with the system (1) and the matrix equation (2)A unique solution expressible in the form (1) restricts the dimensions of $A$The factorization (1) is called the $LU$-factorizationIt is very uncommon for the condition (1) to be violatedThe relation (1) guarantees that the computed solution gives very small residualThis conclusion follows from the assumptions (1) and (2)The factor (1) introduced in relation (2) is now equal to 2The inequalities (1) are still adequateWe use this result without explicitly referring to the restriction (1)Русско-английский словарь по прикладной математике и механике > Определенные артикли перед существительными, которые снабжены ссылками
См. также в других словарях:
Eigenvalue, eigenvector and eigenspace — In mathematics, given a linear transformation, an Audio|De eigenvector.ogg|eigenvector of that linear transformation is a nonzero vector which, when that transformation is applied to it, changes in length, but not direction. For each eigenvector… … Wikipedia
Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… … Wikipedia
Jacobi eigenvalue algorithm — The Jacobi eigenvalue algorithm is a numerical procedure for the calculation of all eigenvalues and eigenvectors of a real symmetric matrix. Description Let varphi in mathbb{R}, , 1 le k < l le n and let J(varphi, k, l) denote the n imes n matrix … Wikipedia
Singular value decomposition — Visualization of the SVD of a 2 dimensional, real shearing matrix M. First, we see the unit disc in blue together with the two canonical unit vectors. We then see the action of M, which distorts the disk to an ellipse. The SVD decomposes M into… … Wikipedia
Lanczos algorithm — The Lanczos algorithm is an iterative algorithm invented by Cornelius Lanczos that is an adaptation of power methods to find eigenvalues and eigenvectors of a square matrix or the singular value decomposition of a rectangular matrix. It is… … Wikipedia
Eigenvalues and eigenvectors — For more specific information regarding the eigenvalues and eigenvectors of matrices, see Eigendecomposition of a matrix. In this shear mapping the red arrow changes direction but the blue arrow does not. Therefore the blue arrow is an… … Wikipedia
Arnoldi iteration — In numerical linear algebra, the Arnoldi iteration is an eigenvalue algorithm and an important example of iterative methods. Arnoldi finds the eigenvalues of general (possibly non Hermitian) matrices; an analogous method for Hermitian matrices is … Wikipedia
Observable — This article is about observables in physics. For the use of the term observable in control theory, see Observability. In physics, particularly in quantum physics, a system observable is a property of the system state that can be determined by… … Wikipedia
Power iteration — In mathematics, the power iteration is an eigenvalue algorithm: given a matrix A , the algorithm will produce a number lambda; (the eigenvalue) and a nonzero vector v (the eigenvector), such that Av = lambda; v .The power iteration is a very… … Wikipedia
Vertex model — A vertex model is a type of statistical mechanics model in which the Boltzmann weights are associated with a vertex in the model (representing an atom or particle). This contrasts with a nearest neighbour model, such as the Ising model, in which… … Wikipedia
Inverse iteration — In numerical analysis, inverse iteration is an iterative eigenvalue algorithm. Based on the power method, this method improves on its performance. Whereas the power method always converges to the largest eigenvalue, inverse iteration also enables … Wikipedia
